Probabilistic complexity theory - PDFSEARCH.IO - Document Search Engine

Probabilistic complexity theory
Results: 385

#	Item
51	Randomized Loose Renaming in O(log log n) Time [Extended Abstract] ∗ † Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:34:00 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Time complexity Algorithm Poisson distribution SL Theoretical computer science Computational complexity theory Applied mathematics
52	Notes on Theory of Distributed Systems CS: Spring 2014 James Aspnes:02 Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2014-05-02 18:02:39 Concurrency control Consensus Probabilistic complexity theory Algorithm Synchronizer Non-blocking algorithm PP Distributed computing Randomized algorithm Theoretical computer science Computational complexity theory Applied mathematics
53	Randomized Distributed Decision Pierre Fraigniaud1 , Amos Korman1? , Merav Parter2 , and David Peleg2?? 1 CNRS and University Paris Diderot, France . {pierre.fraigniaud,amos.korman}@liafa.jussieu.fr Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2012-10-01 06:03:40 Randomized algorithm XTR Applied mathematics Mathematics Theoretical computer science Analysis of algorithms Probabilistic complexity theory
54	Exercise 1 (A streaming algorithm for counting the number of distinct values). [⋆] We are given a stream of numbers x1 , . . . , xn ∈ [m] and we want to compute the number of distinct values in the stream: F0 (x) = Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2015-01-19 07:51:43 Analysis of algorithms Probabilistic complexity theory Randomized algorithm
55	Local Distributed Decision∗ Pierre Fraigniaud† Amos Korman† David Peleg‡ Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2011-10-30 17:16:12 NP-complete problems Network flow Operations research Probabilistic complexity theory Randomized algorithm Modular decomposition Dominating set Flow network XTR Theoretical computer science Mathematics Graph theory
56	Microsoft Word - Kneidl_EMEVAC_2011_final.docx Add to Reading List Source URL: www.cms.bgu.tum.de Language: English - Date: 2014-12-18 07:59:00 Probabilistic complexity theory Algorithm Mathematical logic Randomized algorithm Ant colony optimization algorithms Computer simulation Genetic algorithm Shortest path problem Nondeterministic algorithm Theoretical computer science Applied mathematics Mathematics
57	Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems arXiv:1012.4889v1 [cs.DS] 22 DecHossein Jowhari1 , Mert Sa˘glam1 , and G´abor Tardos1,2 Add to Reading List Source URL: arxiv.org Language: English - Date: 2010-12-22 20:04:48 Analysis of algorithms Probabilistic complexity theory Quantum complexity theory Randomized algorithm Chernoff bound PP Big O notation Theoretical computer science Computational complexity theory Applied mathematics
58	This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution and shar Add to Reading List Source URL: www-m6.ma.tum.de Language: English - Date: 2011-12-07 06:14:53 Numerical analysis Computational science Electromagnetic radiation Chemical engineering Monte Carlo method Probabilistic complexity theory Radiative transfer Heat transfer Algorithm Applied mathematics Mathematics Science
59	Efficient Parameter Variation Sampling for Architecture Simulations Feng Lu Russ Joseph Add to Reading List Source URL: users.eecs.northwestern.edu Language: English - Date: 2011-03-04 16:19:11 Monte Carlo methods Numerical analysis Randomness Statistical inference Probabilistic complexity theory Sampling Low-discrepancy sequence Estimation theory Random sample Statistics Probability and statistics Mathematics
60	A subexponential lower bound for the Random Facet algorithm for Parity Games Oliver Friedmann∗ Thomas Dueholm Hansen† Add to Reading List Source URL: files.oliverfriedmann.de Language: English - Date: 2012-02-10 07:43:15 Probabilistic complexity theory Randomized algorithm Permutation Structure LP-type problem Mathematics Theoretical computer science Analysis of algorithms